Subsumption-stratified datalog
نویسندگان
چکیده
منابع مشابه
Multi Dimensional CTL and Stratified Datalog
In this work we define Multi Dimensional CTL (MD-CTL in short) by extending CTL which is the dominant temporal specification language in practice. The need for Multi Dimensional CTL is mainly due to the advent of semi-structured data. The common path nature of CTL and XPath which provides a suitable model for semi-structured data, has caused the emergence of work on specifying a relation among ...
متن کاملHierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
We establish a general hierarchy theorem for quantiier classes in the innnitary logic L ! 1! on nite structures. In particular, it is shown that no innnitary formula with bounded number of universal quantiiers can express the negation of a transitive closure. This implies the solution of several open problems in nite model theory: On nite structures, positive transitive closure logic is not clo...
متن کاملA compiler for stratified Datalog programs: preliminary results
Deductive databases originated from the confluence between logic programming and databases. The core language of deductive databases is Datalog, which has recently found a renewed interest and new applications in several real-world problems. The evaluation of Datalog is traditionally implemented in monolithic systems that are generalpurpose in the sense that they are able to process an entire c...
متن کاملMaltsev + Datalog --> Symmetric Datalog
Let B be a finite, core relational structure and let A be the algebra associated to B, i.e. whose terms are the operations on the universe of B that preserve the relations of B. We show that if A generates a so-called arithmetical variety then CSP(B), the constraint satisfaction problem associated to B, is solvable in Logspace; in fact ¬CSP(B) is expressible in symmetric Datalog. In particular,...
متن کاملExtending Stratified Datalog to Capture Complexity Classes Ranging from P to QH∗
This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems that can be solved in polynomial time by a deterministic Turing machine using a constant number of calls to an NP-oracle. The solution is based on (i) stratified negation as the core of a sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1998
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(97)10007-3